Given an array of integers nums, find the maximum length of a subarray where the product of all its elements is positive.
A subarray of an array is a consecutive sequence of zero or more values taken out of that array.
Return the maximum length of a subarray with positive product.
Input: nums = [1,-2,-3,4] Output: 4 Explanation: The array nums already has a positive product of 24.
Input: nums = [0,1,-2,-3,-4] Output: 3 Explanation: The longest subarray with positive product is [1,-2,-3] which has a product of 6. Notice that we cannot include 0 in the subarray since that'll make the product 0 which is not positive.
Input: nums = [-1,-2,-3,0,1] Output: 2 Explanation: The longest subarray with positive product is [-1,-2] or [-2,-3].
Input: nums = [-1,2] Output: 1
Input: nums = [1,2,3,5,-6,4,0,10] Output: 4
1 <= nums.length <= 10^5-10^9 <= nums[i] <= 10^9
implSolution{pubfnget_max_len(nums:Vec<i32>) -> i32{letmut ret = 0;for v in nums.split(|&num| num == 0){letmut tmp = v.len();if v.iter().filter(|&&x| x < 0).count() % 2 == 1{let l_ne = v.iter().position(|&x| x < 0);let r_ne = v.iter().rev().position(|&x| x < 0); tmp -= l_ne.min(r_ne).unwrap() + 1;} ret = ret.max(tmp);} ret asi32}}